Particle Swarm Optimization applied to the bi-objective Travelling Salesman Problem.
نویسندگان
چکیده
منابع مشابه
A Hybrid Particle Swarm Optimization – Simulated Annealing Algorithm for the Probabilistic Travelling Salesman Problem
The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the well known Traveling Salesman Problem (TSP). This problem arises when the information about customers demand is not available at the moment of the tour generation and/or the tour re-calculating cost is too elevated. In this article, a Hybrid Algorithm combining Particle Swarm Optimization (PSO) and Simulated Annealing (SA...
متن کاملSolving a new bi-objective model for a cell formation problem considering labor allocation by multi-objective particle swarm optimization
Mathematical programming and artificial intelligence (AI) methods are known as the most effective and applicable procedures to form manufacturing cells in designing a cellular manufacturing system (CMS). In this paper, a bi-objective programming model is presented to consider the cell formation problem that is solved by a proposed multi-objective particle swarm optimization (MOPSO). The model c...
متن کاملUsing Multi-Objective Particle Swarm Optimization for Bi-objective Multi-Mode Resource-Constrained Project Scheduling Problem
In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used...
متن کاملParticle Swarm Optimization Algorithm for the Traveling Salesman Problem
Particle swarm optimization, PSO, is an evolutionary computation technique inspired in the behavior of bird flocks. PSO algorithms were first introduced by Kennedy & Eberhart (1995) for optimizing continuous nonlinear functions. The fundamentals of this metaheuristic approach rely on researches where the movements of social creatures were simulated by computers (Reeves, 1983; Reynolds, 1987; He...
متن کاملA Particle Swarm-based Metaheuristic to Solve the Travelling Salesman Problem
This paper describes a new metaheuristic technique to solve the travelling salesman problem based on particle swarm using guided local search. The main contribution of the paper is that is develops a particle swarm-based strategy to solve combinatorial optimization problems in general, and the TSP in particular. It first establishes the steps to be followed in the new method and then goes on to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTELIGENCIA ARTIFICIAL
سال: 2006
ISSN: 1988-3064,1137-3601
DOI: 10.4114/ia.v10i32.929